Saturation Heuristic for Faster Bisimulation with Petri Nets
نویسنده
چکیده
Bisimilarity is an extensional notion of equivalence of states of an automata. A bisimulation is a set of such equivalences among the states of automata. The bisimulation problem is the task of deciding bisimilarity for all pairs of states of an automata. The present work applies the Saturation [15] heuristic and interleaved MDD partition representation to the bisimulation problem. Previous work [15] comparing the use of various partition representations in a classical fixed-point algorithm for the bisimulation problem, motivated the present work. By focusing on bisimulation for systems with deterministic transition relations (Petri Nets) we show that bisimulation can be expressed as a state-space exploration problem. This suggests the use of the saturation[3] heuristic, which has been found to be relatively efficient for state-space generation. The present work explores the use of our novel saturation-based bisimulation algorithm in the context of the SmArT verification tool. We compare the execution time and memory consumption of our saturation-based fully-implicit methods (using interleaved MDDs) with the execution time and memory consumption of fully-implicit and partially-implicit methods (using non-interleaved MDDs) considered in the previous work, as applied to the same bisimulation problems. We found that with some models having very many equivalence classes in their bisimulation partitions, our novel algorithm gave better speed performance than any of the other algorithms tested. The memory utilization of the classic algorithm was surprisingly better in those cases where it could be applied. With models having very small numbers of equivalence classes in their bisimulation partitions, our novel algorithm performed only slightly less well than the fastest algorithm, while the classic algorithm continues to show better memory utilization.
منابع مشابه
A Fully Symbolic Bisimulation Algorithm
We apply the saturation heuristic to the bisimulation problem for deterministic discrete-event models, obtaining the fastest to date symbolic bisimulation algorithm, able to deal with large quotient spaces. We compare performance of our algorithm with that of Wimmer et al., on a collection of models. As the number of equivalence classes increases, our algorithm tends to have improved time and s...
متن کاملPetri nets and resource bisimulation
Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn’t change the Petri net’s behavior. We define the relations of resource similarity and resource bisimulation and show that they are finitely based. In this paper the resource bisimulation is studied for different classes of Petri nets: ordinary Pe...
متن کاملOn the Resource Equivalences in Petri Nets with Invisible Transitions
Two resources (submarkings) are called similar if in any marking any one of them can be replaced by another one without affecting the net’s behaviour (modulo marking bisimulation). It is known that resource similarity is undecidable for general labelled Petri nets. In this paper we study the properties of resource similarity and resource bisimulation (a subset of complete similarity relation, c...
متن کاملPetri Nets and Bisimulations
Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the present paper is to illustrate the use of such relationships by transferring to Petri nets a general conc...
متن کاملHybrid Time Delay Petri Nets as a Mathematical Novel Tool to Model Dynamic System with Current Sample Time
The existing modeling methods using Petri Nets, have been successfully applied to model and analyze dynamic systems. However, these methods are not capable of modeling all dynamic systems such as systems with the current sample time signals, systems including various subsystems and multi-mode systems. This paper proposes Hybrid Time Delay Petri Nets (HTDPN) to solve the problem. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009